More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems
نویسنده
چکیده
منابع مشابه
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
The consensus problem is one of the most fundamental and important problems for designing fault-tolerant distributed systems. In the consensus problem, each process proposes a value, and all non-faulty processes have to agree on a common value that is proposed by a process. Despite of many applications (e.g., atomic broadcast [2, 6], shared object [1, 7], weak atomic commitment [5]), it is know...
متن کاملAsynchronous Convex Consensus in the Presence of Crash Faults
This paper defines a new consensus problem, convex consensus. Similar to vector consensus [13, 20, 19], the input at each process is a d-dimensional vector of reals (or, equivalently, a point in the d-dimensional Euclidean space). However, for convex consensus, the output at each process is a convex polytope contained within the convex hull of the inputs at the fault-free processes. We explore ...
متن کاملCoordination Problems in Distributed Systems (extended Abstract)
In this paper we provide a framework for understanding and comparing various lower bounds and impossibility results concerning the solution to coordination problems like atomic commit for distributed transactions and other consensus problems . The key to our treatment is the distinction between information that is transferred by (datagram) messages and information that can be deduced from the e...
متن کاملByzantine Fault Detectors for Solving Consensus
Unreliable fault detectors can be defined in terms of completeness and accuracy properties and can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. First, we define and categorize Byzantine faults. We then define two new completeness propert...
متن کاملImpossibility of (Repeated) Reliable Broadcast
We consider the problem of Generic Repeated Coordination, of which Reliable Broadcast and Repeated Distributed Consensus are but two instances. We show that in the absence of in nite storage capacity, all problems in this class require perfect failure detectors, highlighting signi cant assumptions made by many protocols assuming reliable broadcast. Our work also shows that the usual reason used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 105 شماره
صفحات -
تاریخ انتشار 1993